High Imperceptible Data Hiding using Remainder Method
نویسندگان
چکیده
منابع مشابه
High Imperceptible Data Hiding using Remainder Method
In this paper we will propose a high quality image steganography technique which can hide secret data within an image in such a way so that it is imperceptible to human eye. This method solves the overlapping problem of remainder and use modulo operator efficiently for hiding purpose. First, we calculate the base eight equivalent of target string. That increases the hiding capacity as well as r...
متن کاملNext generation techniques for robust and imperceptible audio data hiding
In this work, we combine recent theoertical and algorithmic advances in the area of information-hiding with the current mature knowledge-base in the human audio perception system to propose a novel audio data-hiding technique that significantly pushes the state-of-the-art in the field. Our work is based on a combination of advances in two disjoint fields: information-hiding and human auditory m...
متن کاملA High-Capacity Data Hiding Method for Polygonal Meshes
This paper presents a high-capacity data hiding method for 3D polygonal meshes. By slightly modifying the distance from a vertex to its traversed neighbors based on quantization, a watermark (i.e., a string of binary numbers) can be embedded into a polygonal mesh during a mesh traversal process. The impact of embedding can be tuned by appropriately choosing the quantization step. The embedded d...
متن کاملDATA HIDING METHOD with HIGH EMBEDDING CAPACITY CHARACTER
Recently, the data hiding method based on the high embedding capacity by using improved EMD method was proposed by Kuo et al.[6]. They claimed that their scheme can not only hide a great deal of secret data but also keep high safety and good image quality. However, in their scheme, the sender and the receiver must share the synchronous random secret seed before they transmit the stego-image eac...
متن کاملData Hiding and Retrieval Using Permutation Index Method
In this paper a novel approach for matrix manipulation and indexing is proposed .Here the elements in a row of matrix are designated by numeric value called ‘permutation index’ followed by the elements of the row being randomised. This is done for all the rows of the matrix and in the end the set of permutation indices are put in the parent matrix and random locations depending on a pre decided...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16693-6817